Towards Map Building and Space Coverage Planning in Robotics

نویسنده

  • JIŘÍ PAVLÍČEK
چکیده

This paper describes new method for building occupancy grid from single camera, automatic calibration of this method and approach how to use this internal representation for cleaning unknown environment. The algorithm is designed for indoor application. This assumption is used for calculating inverse perspective transformation of the gathered image. The paper brings an overview of path-planning methods targeted on complete coverage of an operating space. Two algorithms for planning coverage based on occupancy grid are outlined and their fundamental properties are compared. Firstly the existing approach to solution of the coverage problem based on cellular decomposition of the working space is discussed and further the method applies border expansion is introduced. Attached experiments verify and compare the newly designed and the existing methods as well as illustrate the final performance of the methods in real environments. Key-Words: Mobile robotics, environment mapping, occupancy grids, space coverage, motion planning

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation of Green Building Concept in Commercial Buildings: Malls and Trade Center in Jakarta

Development which is less attention to the environment, inefficient use of energy as well as the increasingly dense city make space for the concept of green building to grow even more in Indonesia . The purpose of this study was to determine the extent to which the implementation of green building principles in commercial buildings. There are three buildings complexes that were examined in this...

متن کامل

Map Learning and Coverage Planning for Robots in Large Unknown Environments

The robotics field has seen indoor robots that are increasingly capable of accurately navigating in buildings and performing service tasks, such as cleaning and transporting items. Given the advances in accurate navigation and robust motion planning, large scale industrial applications become feasible tasks. Two common tasks are the mapping of large unknown structured spaces and using learned m...

متن کامل

Robot Map Building by Kohonen’s Self-Organizing Neural Networks

A fundamental issue in mobile robotics is map building. The term refers to cases where a robot is forced to move in an unknown environment and has to build a map entirely based on its sensory information. In this paper we present a method for building robot maps by using a Kohonen’s self-organizing artificial neural network, and describe how path planning can be subsequently performed on such a...

متن کامل

Concurrent dynamic programming for grid-based problems and its application for real-time path planning

This paper presents a concurrent approach for solving dynamic programming optimization problems such as the generation of optimal cost-to-go functions for robot motion planning in dense environments. Such optimization techniques are core to many robotics problems, but traditional approaches are inherently impractical due to their computational complexity. This limitation usually results in a co...

متن کامل

Nearest Neighborhood search in Motion Planning

Nearest Neighbor Search plays a vital role in building road-maps in Motion Planning. These are implemented in any Road-map building method such as PRM, OBPRM, Gauss PRM, etc. Motion Planning is the science of designing a successfully implementable plan in any Configuration Space (often called C-space) in order to move the Robot from a given Start Configuration to a Goal Configuration by avoidin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002